Predominant Cognitive Learning Particle Swarm Optimization for Global Numerical Optimization

نویسندگان

چکیده

Particle swarm optimization (PSO) has witnessed giant success in problem optimization. Nevertheless, its performance seriously degrades when coping with problems a lot of local optima. To alleviate this issue, paper designs predominant cognitive learning particle (PCLPSO) method to effectively tackle complicated problems. Specifically, for each particle, new promising exemplar is constructed by letting personal best position cognitively learn from better experience randomly selected those others based on novel strategy. As result, different particles preserve guiding exemplars. In way, the effectiveness and diversity are expectedly improved. eliminate dilemma that PCLPSO sensitive involved parameters, we propose dynamic adjustment strategies, so parameter settings, which further beneficial promote particles. With above techniques, proposed could compromise search intensification diversification good way complex solution space properly achieve satisfactory performance. Comprehensive experiments conducted commonly adopted CEC 2017 benchmark function set testify devised PCLPSO. Experimental results show obtains considerably competitive or even much more than several representative state-of-the-art peer methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taguchi-Particle Swarm Optimization for Numerical Optimization

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the ...

متن کامل

A Novel Particle Swarm Optimization Algorithm for Global Optimization

Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire popu...

متن کامل

Particle Swarm Optimization with Reduction for Global Optimization Problems

This paper presents an algorithm of particle swarm optimization with reduction for global optimization problems. Particle swarm optimization is an algorithm which refers to the collective motion such as birds or fishes, and a multi-point search algorithm which finds a best solution using multiple particles. Particle swarm optimization is so flexible that it can adapt to a number of optimization...

متن کامل

Constricted Particle Swarm Optimization based Algorithm for Global Optimization

Particle Swarm Optimization (PSO) is a bioinspired meta-heuristic for solving complex global optimization problems. In standard PSO, the particle swarm frequently gets attracted by suboptimal solutions, causing premature convergence of the algorithm and swarm stagnation. Once the particles have been attracted to a local optimum, they continue the search process within a minuscule region of the ...

متن کامل

Feedback learning particle swarm optimization

In this paper, a feedback learning particle swarm optimization algorithm with quadratic inertia weight (FLPSOQIW) is developed to solve optimization problems. The proposed FLPSO-QIW consists of four steps. Firstly, the inertia weight is calculated by a designed quadratic function instead of conventional linearly decreasing function. Secondly, acceleration coefficients are determined not only by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10101620